/*
 	Tool for Path Finding Algorithm Testing (ToPFAT) 
 	
    Copyright (C) 2009, Teemu Turunen and Arttu Viljakainen 
    Published under GNU General Public License V3 
    (see http://www.gnu.org/licenses/licenses.html)
    
    This file is part of Tool for Path Finding Algorithm Testing.

    Tool for Path Finding Algorithm Testing is free software: you can 
    redistribute it and/or modify it under the terms of the GNU General 
    Public License as published by the Free Software Foundation, 
    either version 3 of the License, or (at your option) any later version.

    Tool for Path Finding Algorithm Testing is distributed in the hope that it
    will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General 
    Public License for more details.

    You should have received a copy of the GNU General Public License
    along with Tool for Path Finding Algorithm Testing. If not, see         <http://www.gnu.org/licenses/>.
 */

package graph;

import java.util.LinkedList;

import pathfinding.gui.Map;

public class Graph {

	private int[][] sourceMap;
	private LinkedNodeList<Node> nodes;
	private LinkedEdgeList<Edge> edges;
	private Map historicalBurdenMap;
	
	public Graph() {
		
	}

	public LinkedNodeList<Node> getNodes() {
		return nodes;
	}

	public void setNodes(LinkedNodeList<Node> nodes) {
		this.nodes = nodes;
	}

	public LinkedEdgeList<Edge> getEdges() {
		return edges;
	}

	public void setEdges(LinkedEdgeList<Edge> edges) {
		this.edges = edges;
	}

	public int[][] getSourceMap() {
		return sourceMap;
	}

	public void setSourceMap(int[][] sourceMap) {
		this.sourceMap = sourceMap;
	}

	public Map getHistoricalBurdenMap() {
		return historicalBurdenMap;
	}

	public void setHistoricalBurden(Map historicalBurden) {
		this.historicalBurdenMap = historicalBurden;
	}
	
}
